Lecture 1, Tues Jan 17: Course Intro, Church-Turing Thesis ● ● ●

Source URL: www.scottaaronson.com

• Theoretical computer science
• Metaphysics
• Computer science
• Alan Turing
• Computability theory
• Theory of computation
• Models of computation
• ChurchTuring thesis
• Quantum computing
• Quantum mechanics
• Turing machine
• Introduction to quantum mechanics

1970 Turing Lecture S o m e C o m m e n t s from a Numerical Analyst J. H. W I L K I N S O N National Physical Laboratory, Teddington, Middlesex, England

Source URL: www.jdl.ac.cn

Turing Lecture: Data Science, National Security and Systems Challenges Date: 2 November 2016, British Library Conference Centre Joining Instructions: Delegates should report to the British Library Conference Centre to co

Source URL: aticdn.s3-eu-west-1.amazonaws.com

CS 150 Lecture Slides Motivation • Automata = abstract computing devices • Turing studied Turing Machines (= computers) before there were any real computers • We will also look at simpler devices than

Source URL: www.cs.ucr.edu

• Formal languages
• Combinatorics
• Mathematics
• Discrete mathematics
• Alphabet
• String
• Finite-state machine
• Structure
• Regular expression
• Induction of regular languages
• Indexed grammar

TURING AWARD LECTURE Reflections on Trusting Trust To wh:t extent sh.ou!d one tr~st a statement that a program is free of Trojan horses. Perhaps It IS more Important to trust the people who wrote the software.

Source URL: informatiques-orphelines.fr

TURING AWARD LECTURE Reflections on Trusting Trust To what extent should one trust a statement that a program is free of Trojan horses? Perhaps it is more important to trust the people who wrote the software.

Source URL: www.ece.cmu.edu

• Software engineering
• Computer programming
• Computing
• Procedural programming languages
• Quine
• D
• ALGOL 68
• XPL
• Printf format string
• C
• Pascal
• Name mangling

Monday 5 October, 2015 Smart Cities  SESSION I : Lecture 2: Turing’s Legacy Michael Batty

Source URL: www.spatialcomplexity.info

6.045J Lecture 6: Turing machines

Source URL: ocw.mit.edu

Lecture on undecidability July 27, 2011 inofficial script based on a lecture by Michael M. Wolf (TU München)

Source URL: problem24.files.wordpress.com

• Computer science
• Computable function
• Halting problem
• Church–Turing thesis
• Turing machine
• Algorithm
• Busy beaver
• Computability
• Entscheidungsproblem
• Computability theory
• Theoretical computer science
• Theory of computation

TURING AWARD LECTURE Reflections on Trusting Trust To what extent should one trust a statement that a program is free of Trojan horses? Perhaps it is more important to trust the people who wrote the software.

Source URL: nuwen.net

• Procedural programming languages
• C
• ALGOL 68
• Printf format string
• D
• Fortran
• Unix
• Quine
• PL/I
• Computing
• Computer programming
• Software engineering